Abstract: In this paper, we focus on sleep scheduling for geographic routing in duty-cycled WSNs with mobile sensors and propose two geographic-distance-based connected-k neighborhood (GCKN) sleep scheduling algorithms. The first one is the geographic-distance-based connected-k neighborhood for first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-k neighborhood for all paths (GCKNA) sleep scheduling algorithm. By theoretical analysis and simulations, we show that when there are mobile sensors, geographic routing can achieve much shorter average lengths for the first transmission path explored in WSNs employing GCKNF sleep scheduling and all transmission paths searched in WSNs employing GCKNA sleep scheduling compared with those in WSNs employing mobile sensors using Weighted Rendezvous Planning (WRP).

Keywords: Connected-k neighborhood (CKN), duty-cycle, geographic routing, mobility, wireless sensor networks (WSNs).